Geometric intersection number and analogues of the curve complex for free groups
نویسندگان
چکیده
منابع مشابه
Geometric Intersection Number and Analogues of the Curve Complex for Free Groups
For the free group FN of finite rank N ≥ 2 we construct a canonical Bonahon-type, continuous and Out(FN )-invariant geometric intersection form 〈 , 〉 : cv(FN ) × Curr(FN ) → R≥0. Here cv(FN ) is the closure of unprojectivized Culler-Vogtmann’s Outer space cv(FN ) in the equivariant Gromov-Hausdorff convergence topology (or, equivalently, in the length function topology). It is known that cv(FN ...
متن کاملAlgebraic and Geometric Intersection Numbers for Free Groups
We show that the algebraic intersection number of Scott and Swarup for splittings of free groups coincides with the geometric intersection number for the sphere complex of the connected sum of copies of S × S.
متن کاملinvestigating the feasibility of a proposed model for geometric design of deployable arch structures
deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...
Triangle-free geometric intersection graphs with large chromatic number
Several classical constructions illustrate the fact that the chromatic number of a graph may be arbitrarily large compared to its clique number. However, until very recently no such construction was known for intersection graphs of geometric objects in the plane. We provide a general construction that for any arc-connected compact set X in R that is not an axis-aligned rectangle and for any pos...
متن کاملComputing the Geometric Intersection Number of Curves
The geometric intersection number of a curve on a surface is the minimal number of selfintersections of any homotopic curve, i.e., of any curve obtained by continuous deformation. Given a curve c represented by a closed walk of length at most ` on a combinatorial surface of complexity n we describe simple algorithms to (1) compute the geometric intersection number of c in O(n+ `2) time, (2) con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Geometry & Topology
سال: 2009
ISSN: 1364-0380,1465-3060
DOI: 10.2140/gt.2009.13.1805